Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
نویسندگان
چکیده
منابع مشابه
Three enhancements for optimization-based bound tightening
Optimization-based bound tightening (OBBT) is one of the most effective procedures to reduce variable domains of nonconvex mixed-integer nonlinear programs (MINLPs). At the same time it is one of the most expensive bound tightening procedures, since it solves auxiliary linear programs (LPs)—up to twice the number of variables many. The main goal of this paper is to discuss algorithmic technique...
متن کاملA Comparison of Strategies for Optimization of Complex Distillation Columns
This work compares several strategies developed for the economical optimization of large-scale complex distillation columns. The performance of each strategy is illustrated considering two examples drawn from industry, regarding the aniline production by liquid hydrogenation of nitrobenzene. Since discrete decisions are involved, related to the optimal location of feed streams and the total num...
متن کاملThree-component Distillation Columns Sequencing: Including Configurations with Divided-wall Columns
In the present work, the exergy analysis and economic study of 3 different samples of threecomponent mixtures have been investigated (ESI>1, ESI≈1, and ESI<1). The feed mixture has been tested under three different compositions (low, equal, and high contents of the intermediate component). A quantitative comparison between simple and complex configurations, considering thermally coupled, thermo...
متن کاملReformulation-Linearization Methods for Global Optimization
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and ...
متن کاملDiscrete Monotonic Global Optimization
Recently a general mathematical framework has been developed [3] for studying mathematical programming problems described by means of increasing functions, or more generally, differences of increasing functions. It has been shown in [3] that any mathematical programming problem of this class can be reduced to an equivalent problem of the following form, called canonical monotonic optimization p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2018
ISSN: 1389-4420,1573-2924
DOI: 10.1007/s11081-018-9377-6